Convergence Acceleration for Some Root nding Methods
نویسندگان
چکیده
{Zusammenfassung Convergence Acceleration for Some Roottnding Methods. We present simple, eecient extrapolation formulas to accelerate the convergence of super-linearly convergent sequences. Applications are given for some roottnding methods such as Newton's method and the secant method. Numerical examples are given showing the eeectiveness of the extrapolation formulas. die EEektivitt at der Extrapolationsformeln.
منابع مشابه
An efficient three-step iterative method with sixth-order convergence for solving nonlinear equations
The aim of this paper is to construct an e¢ cient iterative method to solve nonlinear equations. This method is obtained from M. Javidis method (Appl. Math. Comput. 193 (2007) 360-365), which is third-order. The convergence order of new method is established to six and the e¢ ciency index is 1.5651. The Proposed method is compared with the second, third and sixth order methods. Some numerical ...
متن کاملSome new restart vectors for explicitly restarted Arnoldi method
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...
متن کاملComparison of acceleration techniques of analytical methods for solving differential equations of integer and fractional order
The work addressed in this paper is a comparative study between convergence of the acceleration techniques, diagonal pad'{e} approximants and shanks transforms, on Homotopy analysis method and Adomian decomposition method for solving differential equations of integer and fractional orders.
متن کاملModified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملAn Optimal Biparametric Multipoint Family and Its Self-Acceleration with Memory for Solving Nonlinear Equations
In this paper, a family of Steffensen-type methods of optimal order of convergence with two parameters is constructed by direct Newtonian interpolation. It satisfies the conjecture proposed by Kung and Traub (J. Assoc. Comput. Math. 1974, 21, 634–651) that an iterative method based on m evaluations per iteration without memory would arrive at the optimal convergence of order 2m−1. Furthermore, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993